Trace minimization method via penalty for linear response eigenvalue problems

نویسندگان

چکیده

<p style='text-indent:20px;'>In various applications, such as the computation of energy excitation states electrons and molecules, analysis interstellar clouds, linear response eigenvalue problem, which is a special type Hamiltonian frequently encountered. However, traditional eigensolvers may not be applicable to this problem owing its inherently large scale. In fact, we are usually more interested in computing some smallest positive eigenvalues. To end, trace minimum principle optimization model with orthogonality constraint has been proposed. On basis, propose an unconstrained surrogate called minimization via penalty, establish equivalence original constrained model, provided that penalty parameter larger than certain threshold. By avoiding constraint, can use gradient-type method solve model. Specifically, gradient descent Barzilai–Borwein step size. Moreover, develop restarting strategy for proposed algorithm whereby higher accuracy faster convergence achieved. This verified by preliminary experimental results.</p>

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A block Chebyshev-Davidson method for linear response eigenvalue problems

We present a Chebyshev-Davidson method to compute a few smallest positive eigenvalues and corresponding eigenvectors of the linear response eigenvalue problem. The method is actually applicable to the slightly more general linear response eigenvalue problem where purely imaginary eigenvalues may occur. For the Chebyshev filter, a tight upper bound is obtained by a computable bound estimator con...

متن کامل

A Penalty Method for Rank Minimization Problems in Symmetric Matrices∗

The problem of minimizing the rank of a symmetric positive semidefinite matrix subject to constraints can be cast equivalently as a semidefinite program with complementarity constraints (SDCMPCC). The formulation requires two positive semidefinite matrices to be complementary. We investigate calmness of locally optimal solutions to the SDCMPCC formulation and hence show that any locally optimal...

متن کامل

A Quasi-Newton Penalty Barrier Method for Convex Minimization Problems

We describe an infeasible interior point algorithm for convex minimization problems. The method uses quasi-Newton techniques for approximating the second derivatives and providing superlinear convergence. We propose a new feasibility control of the iterates by introducing shift variables and by penalizing them in the barrier problem. We prove global convergence under standard conditions on the ...

متن کامل

Minimization Principle for Linear Response Eigenvalue Problem with Applications

We present a minimization principle for the sum of the first few smallest positive eigenvalues and Cauchy-like interlacing inequalities for the linear response eigenvalue problem arising from the calculation of excitation states of many-particle systems, a hot topic among computational material scientists today for materials design to advance energy science. Subsequently, we develop the best ap...

متن کامل

Minimization Principles for the Linear Response Eigenvalue Problem II: Computation

In Part I of this paper we presented a minimization principle and related theoretical results for the linear response eigenvalue problem. Here we develop best approximations of the smallest few positive eigenvalues via a structure-preserving subspace projection. Then we present a four-dimensional subspace search conjugate gradient-like algorithm for simultaneously computing these eigenvalues an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Industrial and Management Optimization

سال: 2023

ISSN: ['1547-5816', '1553-166X']

DOI: https://doi.org/10.3934/jimo.2021206